type github.com/andybalholm/brotli.hashRolling

16 uses

	github.com/andybalholm/brotli (current package)
		hash.go#L264: 			hb: &hashRolling{jump: 4},
		hash.go#L297: 			hb: &hashRolling{jump: 4},
		hash.go#L302: 			hb: &hashRolling{jump: 1},
		hash_rolling.go#L19: func (*hashRolling) HashTypeLength() uint {
		hash_rolling.go#L23: func (*hashRolling) StoreLookahead() uint {
		hash_rolling.go#L29: func (*hashRolling) HashByte(b byte) uint32 {
		hash_rolling.go#L33: func (h *hashRolling) HashRollingFunctionInitial(state uint32, add byte, factor uint32) uint32 {
		hash_rolling.go#L37: func (h *hashRolling) HashRollingFunction(state uint32, add byte, rem byte, factor uint32, factor_remove uint32) uint32 {
		hash_rolling.go#L43: type hashRolling struct {
		hash_rolling.go#L55: func (h *hashRolling) Initialize(params *encoderParams) {
		hash_rolling.go#L75: func (h *hashRolling) Prepare(one_shot bool, input_size uint, data []byte) {
		hash_rolling.go#L86: func (*hashRolling) Store(data []byte, mask uint, ix uint) {
		hash_rolling.go#L89: func (*hashRolling) StoreRange(data []byte, mask uint, ix_start uint, ix_end uint) {
		hash_rolling.go#L92: func (h *hashRolling) StitchToPreviousBlock(num_bytes uint, position uint, ringbuffer []byte, ring_buffer_mask uint) {
		hash_rolling.go#L119: func (*hashRolling) PrepareDistanceCache(distance_cache []int) {
		hash_rolling.go#L122: func (h *hashRolling) FindLongestMatch(dictionary *encoderDictionary, data []byte, ring_buffer_mask uint, distance_cache []int, cur_ix uint, max_length uint, max_backward uint, gap uint, max_distance uint, out *hasherSearchResult) {